Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View

The paper considers spin systems on the d-dimensional integer lattice Z with nearestneighbor interactions. A sharp equivalence is proved between decay with distance of spin correlations (a spatial property of the equilibrium state) and rapid mixing of the Glauber dynamics (a temporal property of a Markov chain Monte Carlo algorithm). Specifically, we show that if the mixing time of the Glauber dynamics is O(n log n) then spin correlations decay exponentially fast with distance. We also prove the converse implication for monotone systems, and for general systems we prove that exponential decay of correlations implies O(n log n) mixing time of a dynamics that updates sufficiently large blocks (rather than single sites). While the above equivalence was already known to hold in various forms, we give proofs that are purely combinatorial and avoid the functional analysis machinery employed in previous proofs. School of Computing, University of Leeds, Leeds LS2 9JT, United Kingdom. ([email protected]). Supported by EPSRC grant “Sharper Analysis of Randomised Algorithms: a Computational Approach” and by EC IST project RAND-APX. Computer Science Division, University of California, Berkeley, Berkeley, CA 94720, U.S.A. ([email protected]). Supported in part by NSF grants CCR-9820951 and CCR-0121555, and by DARPA cooperative agreement F30602-00-2-060. Department of Computer Science, University of Chicago, Chicago, IL 60637, U.S.A. ([email protected]) Computer Science Division, University of California, Berkeley, Berkeley, CA 94720, U.S.A. ([email protected]). Supported in part by NSF grants CCR-9820951 and CCR-0121555, and by DARPA cooperative agreement F30602-00-2-060.